Subgradients of value functions in parametric dynamic programming q

نویسندگان

  • B. T. Kien
  • Y. C. Liou
  • J.-C. Yao
چکیده

We study in this paper the first-order behavior of value functions in parametric dynamic programming with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of value functions of parametric mathematical programming problems, some new formulas on the Fréchet subdifferential of value functions in parametric dynamic programming are obtained. 2007 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgradients of value functions in parametric dynamic programming

We study in this paper the first-order behavior of value functions in parametric dynamic programming with linear constraints and nonconvex cost functions. By establishing an abstract result on the Fréchet subdifferential of value functions of parametric mathematical programming problems, some new formulas on the Fréchet subdifferential of value functions in parametric dynamic programming are ob...

متن کامل

Mordukhovich Subgradients of the Value Function in a Parametric Optimal Control Problem

This paper is devoted to the study the first-order behavior of the value function of a parametric optimal control problem with linear constraints and a nonconvex cost function. By establishing an abstract result on the Mordukhovich subdifferential of the value function of a parametric mathematical programming problem, we derive a formula for computing the Mordukhovich subdifferential of the val...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

Uniqueness of meromorphic functions ans Q-differential polynomials sharing small functions

‎The paper concerns interesting problems related to the field of Complex Analysis‎, ‎in particular, Nevanlinna theory of meromorphic‎ ‎functions‎. ‎We have studied certain uniqueness problem on differential polynomials of meromorphic functions sharing a‎ ‎small function‎. ‎Outside‎, ‎in this paper‎, ‎we also consider the uniqueness of $q-$ shift difference‎ - ‎differential polynomials‎ ‎of mero...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016